A complete proof system for propositional projection temporal logic
نویسندگان
چکیده
The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To facilitate proofs, some of the frequently used theorems are proved. A normal form of PPTL formulas is presented, and the soundness and completeness of the proof system are demonstrated. To show how the axiom system works, a full omega regular property for the mutual exclusion problem is specified by a PPTL formula and then a deductive proof of the property is performed. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
A Complete Proof System for First-order Interval Temporal Logic with Projection
This paper presents an ω-complete proof system for the extension of first order Interval Temporal Logic (ITL, [12, 15, 4]) by a projection operator [16, 11]. Alternative earlier approaches to the axiomatisation of projection in ITL are briefly presented and discussed. An extension of the proof system which is complete for the extension of Duration Calculus (DC , [24]) by projection is also given.
متن کاملComplete Proof System for QPTL
The paper presents an axiomatic system for quantified propositional temporal logic (QPTL), which is propositional temporal logic equipped with quantification over propositions (Boolean variables). The advantages of this extended temporal logic is that its expressive power is strictly higher than that of the unquantified version (PTL) and is equal to that of S1S, as well as that of -automata. An...
متن کاملA Complete Proof Systems for QPTL
The paper presents an axiomatic system for quan-tiied propositional temporal logic (qptl), which is propositional temporal logic equipped with quantii-cation over propositions (boolean variables). The advantages of this extended temporal logic is that its expressive power is strictly higher than that of the un-quantiied version (ptl) and is equal to that of S1S, as well as that of !-automata. A...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAxioms for Real-Time Logics
This paper presents a complete axiomatization of fully decid-able propositional real-time linear temporal logics with past: the Event Clock Logic (ECL) and the Metric Interval Temporal Logic with past (MITL). The completeness proof consists of an eeective proof building procedure for ECL. From this result we obtain a complete axiomatization of MITL by providing axioms translating MITL formulae ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 497 شماره
صفحات -
تاریخ انتشار 2013